翻訳と辞書
Words near each other
・ B'z The Best XXV 1988-1998
・ B'z The Best XXV 1999-2012
・ B'z TV Style II Songless version
・ B'z TV Style Songless version
・ B(e) star
・ B(if)tek
・ B*
・ B*A*P*S
・ B*Witched
・ B*Witched (album)
・ B*Witched discography
・ B+
・ B+ tree
・ B+H Architects
・ B+H Ocean Carriers
B,C,K,W system
・ B-
・ B-1 cell
・ B-1 Nuclear Bomber
・ B-1,3-galactosyl-O-glycosyl-glycoprotein b-1,3-N-acetylglucosaminyltransferase
・ B-1,3-galactosyl-O-glycosyl-glycoprotein b-1,6-N-acetylglucosaminyltransferase
・ B-1,4-mannosyl-glycoprotein 4-b-N-acetylglucosaminyltransferase
・ B-10 motorway (Spain)
・ B-10 recoilless rifle
・ B-11 recoilless rifle
・ B-17 Bomber (video game)
・ B-17 Flying Fortress (video game)
・ B-17 Flying Fortress units of the United States Army Air Forces
・ B-17, Queen of the Skies
・ B-2 status


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

B,C,K,W system : ウィキペディア英語版
B,C,K,W system
The B, C, K, W system is a variant of combinatory logic that takes as primitive the combinators B, C, K, and W. This system was discovered by Haskell Curry in his doctoral thesis ''Grundlagen der kombinatorischen Logik'', whose results are set out in Curry (1930).
The combinators are defined as follows:
* B ''x y z'' = ''x'' (''y z'')
* C ''x y z'' = ''x z y''
* K ''x y'' = ''x''
* W ''x y'' = ''x y y''
Intuitively,
* B ''x y'' is the composition of the arguments ''x'' and ''y'';
* C ''x y z'' swaps the arguments ''y'' and ''z'';
* K ''x y'' discards the argument ''y'';
* W ''x y'' duplicates the argument ''y''.
In recent decades, the SKI combinator calculus, with only two primitive combinators, K and S, has become the canonical approach to combinatory logic. B, C, and W can be expressed in terms of S and K as follows:
* B = S (K S) K
* C = S (S (K (S (K S) K)) S) (K K)
* K = K
* W = S S (S K)
Going the other direction, SKI can be defined in terms of B,C,K,W as:
* I = W K
* K = K
* S = B (B (B W) C) (B B) = B (B W) (B B C).〔Raymond Smullyan (1994) ''Diagonalization and
Self-Reference''. Oxford Univ. Press: 344, 3.6(d) and 3.7.〕
==Connection to intuitionistic logic==
The combinators B, C, K and W correspond to four well-known axioms of sentential logic:
AB: (''B'' → ''C'') → ((''A'' → ''B'') → (''A'' → ''C'')),
AC: (''A'' → (''B'' → ''C'')) → (''B'' → (''A'' → ''C'')),
AK: ''A'' → (''B'' → ''A''),
AW: (''A'' → (''A'' → ''B'')) → (''A'' → ''B'').
Function application corresponds to the rule modus ponens:
MP: from ''A'' and ''A'' → ''B'' infer ''B''.
The axioms AB, AC, AK and AW, and the rule MP are complete for the implicational fragment of intuitionistic logic. In order for combinatory logic to have as a model:
*The implicational fragment of classical logic, would require the combinatory analog to the law of excluded middle, e.g., Peirce's law;
*Complete classical logic, would require the combinatory analog to the sentential axiom F → ''A''.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「B,C,K,W system」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.